Queues with Time-Varying Arrivals and Inspections with Applications to Hospital Discharge Policies

نویسندگان

  • Carri W. Chan
  • Jing Dong
  • Linda V. Green
چکیده

In order for a patient to be discharged from a hospital unit, a physician must first perform a physical examination and review the pertinent medical information to determine that the patient is stable enough to be transferred to a lower level of care or be discharged home. Requiring an inspection of a patient’s ‘readiness for discharge’ introduces an interesting dynamic where patients may occupy a bed longer than medically necessary. Motivated by this phenomenon, we introduce a queueing system with time-varying arrival rates in which servers who have completed service cannot be released until an inspection occurs. We examine how such a dynamic impacts common system measures such as stability, expected number of customers in the system, probability of waiting and expected waiting time. Leveraging insights from an infinite-server model, we’re able to optimize the timing of inspections and find via theoretical and numerical analysis that 1) optimizing a single inspection time could lead to significant improvements in system performance when the amplitude of the arrival rate function is large, 2) multiple inspections should be uniformly distributed throughout the day, and 3) the marginal improvements of adding additional inspection times is decreasing.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Time-Varying Queues

Service systems abound with queues, but the most natural direct models are often timevarying queues, which require nonstandard analysis methods beyond stochastic textbooks. This paper surveys the literature on time-varying queues. Most of the literature concerns manyserver queues, which arise in large-scale service systems, such as in customer contact centers and hospital emergency departments,...

متن کامل

Throughput Optimal Scheduling Policies in Networks of Interacting Queues

This paper considers a fairly general model of constrained queuing networks that allows us to represent both MMBP (Markov Modulated Bernoulli Processes) arrivals and time-varying service constraints. We derive a set of sufficient conditions for throughput optimality of scheduling policies, which encompass and generalize all the results previously obtained in the field. This leads to the definit...

متن کامل

The Analysis of Queues with Time-Varying Rates for Telecommunication Models

Time dependent behavior has an impact on the performance of telecommunication models. Examples include: staffing a call center, pricing the inventory of private line services for profit maximization, and measuring the time lag between the peak arrivals and peak load for a system. These problems and more motivate the development of a queueing theory with time varying rates. Queueing theory as di...

متن کامل

MODELLING AND ANALYSIS OF A DISCRETE-TIME PRIORITY QUEUING COMPUTER NETWORK WITH PRIORITY JUMPS USING PROBABILITY GENERATING FUNCTIONS

Priority queues have a great importance in the study of computer communication networks in which different types of traffic require different quality of service standards. The discrete-time non-preemptive priority queuing model with priority jumps is proposed in this paper. On the basis of probability generating functions mean system contents and mean queuing delay characteristics are obtained....

متن کامل

Discrete-time Priority Queues with Two-state Markov Modulated Arrivals

A class of discrete-time priority queueing systems with Markov modulated arrivals is considered. In these systems, N queues are served by a single server according to priorities that are preassigned to the queues. Packet arrivals are modeled as discrete-time batch processes with a distribution that depends on the state of an independent common two-state Markov chain. This allows to cover a wide...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Operations Research

دوره 65  شماره 

صفحات  -

تاریخ انتشار 2017